منابع مشابه
Comparison between Frequentist Test and Bayesian Test to Variance Normal in the Presence of Nuisance Parameter: One-sided and Two-sided Hypothesis
This article is concerned with the comparison P-value and Bayesian measure for the variance of Normal distribution with mean as nuisance paramete. Firstly, the P-value of null hypothesis is compared with the posterior probability when we used a fixed prior distribution and the sample size increases. In second stage the P-value is compared with the lower bound of posterior probability when the ...
متن کاملOne-Sided Interval Trees
We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.
متن کاملMinimum Kolmogorov–Smirnov test statistic parameter estimates
When a reliability analysis, survival analysis, or discrete-event simulation input modeling analysis is performed, it is typically the case that a modeler collects data associated with some system under consideration. Although this raw data provides an initial insight into the stochastic elements of the system, often it is desirable to construct a model of the system which is tractable for math...
متن کاملA New Minimum Order Lumped-Parameter Model of Circulatory System for Patients with Suffered Left and Right-Sided Heart Failure
In this study a new minimum lumped electrical model of total circulatory system through numerical solutions to approximate the response of the human circulatory system was presented. Among five existent ventricular elastances as activity function of heart pumps, a more accurate model was chosen as well as the operation of baroreflex system to accommodate variations in heart rate and systemic va...
متن کاملFixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the problem onesided crossing minimization which plays an important role in graph drawing algorithms based on the Sugiyama layering approach. Moreover, we improve on the search tree algorithm developed in [5] and derive an O(1.4656k + kn) algorithm for this problem, where k upperbounds the number of tolerated crossings of straight lines involved in the draw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1994
ISSN: 0286-522X
DOI: 10.5109/13437